Efficient Method for Look-Up-Table Design in Memory Based Fir Filters

Distributed arithmetic (DA)-based computation is well known for efficient memory-based implementation of Finite impulse response (FIR) filter where the filter outputs are computed as inner-product of input-sample vectors and filter-coefficient vector. In this paper, we show that the LUT multiplier based approach in which the memory elements store all the possible values of product of filter co-efficient will be the efficient in terms of area with the same throughput in comparison of DA. We present two new approaches to LUT-based multiplication, which could be used to reduce the memory size to half of the conventional LUT-based multiplication. The proposed method in this paper have half memory required than the existing DA method .The DA and the proposed LUT method are simulated and synthesized using the Xilinx tool and the memory required by the proposed LUT is nearly 50% lesser than the DA.